Automatic Rectangular Refinement of Affine Hybrid Systems
نویسندگان
چکیده
We show how to automatically construct and refine rectangular abstractions of systems of linear differential equations. From a hybrid automaton whose dynamics are given by a system of linear differential equations, our method computes automatically a sequence of rectangular hybrid automata that are increasingly precise overapproximations of the original hybrid automaton. We prove an optimality criterion for successive refinements. We also show that this method can take into account a safety property to be verified, refining only relevant parts of the state space. The practicability of the method is illustrated on a benchmark case study.
منابع مشابه
Assume-Guarantee Abstraction Refinement Meets Hybrid Systems
Compositional verification techniques in the assumeguarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We inte...
متن کاملHybridization Based CEGAR for Hybrid Automata with Affine Dynamics
We consider the problem of safety verification for hybrid systems, whose continuous dynamics in each mode is affine, Ẋ = AX + b, and invariants and guards are specified using rectangular constraints. We present a counter-example guided abstraction refinement framework (CEGAR), which abstract these hybrid automata into simpler ones with rectangular inclusion dynamics, ẋ ∈ I, where x is a variabl...
متن کاملReachability Analysis of Multi-affine Systems
We present a technique for reachability analysis of continuous multi-affine systems based on rectangular partitions. The method is iterative. At each step, finer partitions and larger discrete quotients are produced. We exploit some interesting convexity properties of multiaffine functions on rectangles to show that the construction of the discrete quotient at each step requires only the evalua...
متن کاملCEGAR Based Bounded Model Checking of Discrete Time Hybrid Systems
Many hybrid systems can be conveniently modeled as Piecewise Affine Discrete Time Hybrid Systems PA-DTHS. As well known Bounded Model Checking (BMC) for such systems comes down to solve a Mixed Integer Linear Programming (MILP) feasibility problem. We present a SAT based BMC algorithm for automatic verification of PA-DTHSs. Using Counterexample Guided Abstraction Refinement (CEGAR) our algorith...
متن کاملHybrid Automata-Based CEGAR for Rectangular Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We show that the CEGAR scheme is semi-complete for the class of rectangul...
متن کامل